Essentially-Rigid Families of Abelian p -Groups

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pseudo-Free Families of Finite Computational Elementary Abelian p-Groups

We initiate the study of (weakly) pseudo-free families of computational elementary abelian pgroups, where p is an arbitrary fixed prime. We restrict ourselves to families of computational elementary abelian p-groups Gd such that for every index d, each element of Gd is represented by a single bit string of length polynomial in the length of d. First, we prove that pseudo-freeness and weak pseud...

متن کامل

Finite $p$-groups and centralizers of non-cyclic abelian subgroups

A $p$-group $G$ is called a $mathcal{CAC}$-$p$-group if $C_G(H)/H$ is ‎cyclic for every non-cyclic abelian subgroup $H$ in $G$ with $Hnleq‎ ‎Z(G)$‎. ‎In this paper‎, ‎we give a complete classification of‎ ‎finite $mathcal{CAC}$-$p$-groups‎.

متن کامل

Pseudorandom Permutation Families over Abelian Groups

We propose a general framework for differential and linear cryptanalysis of block ciphers when the block is not a bitstring. We prove piling-up lemmas for the generalized differential probability and the linear potential, and we study their lower bounds and average value, in particular in the case of permutations of Fp. Using this framework, we describe a toy cipher, that operates on blocks of ...

متن کامل

G.C.H. implies existence of many rigid almost free abelian groups

This result has been generalized in various directions, e.g. replacing the ground ring Z by a more general ring and dropping the cardinal restriction (in Corner’s result this is actually |A| < 20), see [2], [20], [8], [9], [4], [23]. Other extensions include abelian groups which are not necessarily torsionfree, see Corner, Göbel [4] for references. Here we are interested in a different strength...

متن کامل

Effective categoricity of Abelian p-groups

We investigate effective categoricity of computable Abelian p-groups A. We prove that all computably categorical Abelian p-groups are relatively computably categorical, that is, have computably enumerable Scott families of existential formulas. We investigate which computable Abelian p-groups are ∆02 categorical and relatively ∆ 0 2 categorical.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the London Mathematical Society

سال: 1978

ISSN: 0024-6107

DOI: 10.1112/jlms/s2-18.1.70